Computer and Modernization ›› 2012, Vol. 1 ›› Issue (9): 170-173.doi: 10.3969/j.issn.1006-2475.2012.09.043
• 算法分析与设计 • Previous Articles Next Articles
LI Jin-hua1, YANG Yong-li2, XING Dan-dan1
Received:
Revised:
Online:
Published:
Abstract: A complex software system is usually affected by a lot of factors. Their interactions complicate the system behavior and cause various faults. It is impossible to exhaustively test all the interactions. Combinatorial testing uses a small number of test cases to guarantee the test quality by considering the factors different influence on systems. The paper proposes a novel method of test suite generation based on harmony search algorithm. The method solves the key issues of N-way combinatorial coverage and variable-strength combinatorial coverage. The experiments demonstrate the effectiveness of the method.
Key words: harmony search, combinatorial testing, test suite, N-way interaction, covering array
LI Jin-hua;YANG Yong-li;XING Dan-dan. Application of Harmony Search Algorithm in Combinatorial Test Case Generation[J]. Computer and Modernization, 2012, 1(9): 170-173.
0 / / Recommend
Add to citation manager EndNote|Ris|BibTeX
URL: http://www.c-a-m.org.cn/EN/10.3969/j.issn.1006-2475.2012.09.043
http://www.c-a-m.org.cn/EN/Y2012/V1/I9/170